Improved bounds and schemes for the declustering problem

Improved Bounds and Schemes for the Declustering Problem

The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous work of several authors concerning range queries to higher-dimensional data. We give a declustering scheme with an additive error of Od(log d−1 M) independe...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem

Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields a ver>' simple algorithm nmning in 0{n^) time on n-vertex networks. Incorporation of the dynamic tree data structure of Sleator and Tarjan yields a more complicated algorithm with a running time of 0{rvn log {n^ Im)) on m-arc networks. Ahuja and Orlin developed a variant of Goldberg's algorithm ...

Improved bounds for the firing synchronization problem

In this pa per we prese nt improve d bounds on the comple xity of solutions to the ¿ ring synchroniza tion problem. In the ¿ ring synchronization proble m we cons ider a one-dime ns ional a rray of n identica l ¿ nite a utoma ta . Initia lly all a utoma ta a re in the same s ta te e xcept for one automaton which is des igna te d a s the initia tor for the synchroniza tion. Our re sults hold for...

Asymptotically Optimal Declustering Schemes for Range Queries